Smoothing iterative block methods for linear systems with multiple right-hand sides
نویسنده
چکیده
In the present paper, we present smoothing procedures for iterative block methods for solving nonsymmetric linear systems of equations with multiple right-hand sides. These procedures generalize those known when solving one right-hand linear systems. We give some properties of these new methods and then, using these procedures we show connections between some known iterative block methods. Finally we give some numerical examples. c © 1999 Elsevier Science B.V. All rights reserved. MSC: 65F10
منابع مشابه
New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملBlock Krylov Space Methods for Linear Systems with Multiple Right-hand Sides: an Introduction
In a number of applications in scientific computing and engineering one has to solve huge sparse linear systems of equations with several right-hand sides that are given at once. Block Krylov space solvers are iterative methods that are especially designed for such problems and have fundamental advantages over the corresponding methods for systems with a single right-hand side: much larger sear...
متن کاملProduct Hybrid Block GMRES for Nonsymmetrical Linear Systems with Multiple Right-hand Sides
Recently, the complementary behavior of restarted GMRES has been studied. We observed that successive cycles of restarted block BGMRES (BGMRES(m,s)) can also complement one another harmoniously in reducing the iterative residual. In the present paper, this characterization of BGMRES(m,s) is exploited to form a hybrid block iterative scheme. In particular, a product hybrid block GMRES algorithm ...
متن کاملBlock Bidiagonalization Methods for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
Many applications require the solution of large nonsymmetric linear systems with multiple right-hand sides. Instead of applying an iterative method to each of these systems individually, it is often more eecient to use a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose block versions of Galerkin/minimal residual pair of bidiagonal...
متن کاملTwo Algorithms for Symmetric Linear Systems with Multiple Right-hand Sides
In this paper, we investigate the block Lanczos algorithm for solving large sparse symmetric linear systems with multiple right-hand sides, and show how to incorporate deeation to drop converged linear systems using a natural convergence criterion, and present an adaptive block Lanczos algorithm. We propose also a block version of Paige and Saun-ders' MINRES method for iterative solution of sym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999